A program for the full axiom of choice

The theory of classical realizability is a framework for the Curry-Howard correspondence which enables to associate program with each proof in Zermelo-Fraenkel set theory. But, almost all applications mathematics physics, probability, statistics, etc. use Analysis i.e. axiom dependent choice (DC) or even (full) (AC). It therefore important find explicit programs these axioms. Various solutions have been found DC, instance lambda-term called "bar recursion" instruction "quote" LISP. We present here first AC.